|
| |
|
|
Robot path planning by means of swarm intelligence
Schimitzek, Aleš ; Krček, Petr (referee) ; Dvořák, Jiří (advisor)
This diploma thesis deals with the path planning by swarm intelligence. In the theoretical part it describes the best known methods of swarm intelligence (Ant Colony Optimization, Bee Swarm Optimization, Firefly Swarm Optimization and Particle Swarm Optimization) and their application for path planning. In the practical part particle swarm optimization is selected for the design and implementation of path planning in the C#.
|
|
|
Novel Applications of Ant Algorithms
Korgo, Jakub ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
Ant algorithms have been used for a variety of combinatorial optimization problems. One of these problems, where ant algorithms haven't been used, is the design of transition rules for cellular automata (CA). Which is a problem that this master's thesis is focused on. This work begins with an introduction into ant algorithms and a overview of its applications, followed by an introduction into CA. In the next part the author proposes a way how to encode rules of CA into a graph which is used in ant algorithms. The last part of this thesis contains an application of encoded graph on elitist ant system and MAX-MIN ant system. This is followed by experimental results of creating transition rules for CA problems by these algorithms.
|
|
|
Traveling Salesman Problem
Šůstek, Martin ; Snášelová, Petra (referee) ; Zbořil, František (advisor)
This thesis is focused on modification of known principles ACO and GA to increase their performance. Thesis includes two new principles to solve TSP. One of them can be used as an initial population generator. The appendix contains the implementation of the application in Java. The description of this application is also part of the thesis. One part is devoted to optimization in order to make methods more efficient and produce shorter paths. In the end of the thesis are described experiments and their results with different number of places from 101 up to 3891.
|
|
| |
|
|
Optimization Methods for SIMLIB/C++ Simulation Library
Chlebík, Jakub ; Janoušek, Vladimír (referee) ; Peringer, Petr (advisor)
This thesis addresses the topic of parametric optimization of simulation models. It introduces theoretical foundation of optimization and its uses in simulation analysis. Furthermore, it suggests the extension of SIMBLI/C++ library by module for optimization methods. Some of the chosen methods are then theoretically described, implemented in C++ language, demonstrates its uses and evaluates their success.
|
|
|
Optimization Using Ant Algorithms
Válek, Matěj ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This bachelor thesis will deal with various applications of ant colony optimisation. In particular, Ant Colony System will be applied on the optimisation of traveling salesman problem and the design of rules for the development of cellular automata. The obtained results will be statistically analysed. Moreover, a GUI-based application has been developed which allows to interactively observe the progress of Ant Colony System for the educational purposes.
|
|
| |
|
|
Analysis of Various Approaches to Solving Optimization Tasks
Knoflíček, Jakub ; Samek, Jan (referee) ; Zbořil, František (advisor)
This paper deals with various approaches to solving optimization tasks. In prolog some examples from real life that show the application of optimization methods are given. Then term optimization task is defined and introducing of term fitness function which is common to all optimization methods follows. After that approaches by particle swarm optimization, ant colony optimization, simulated annealing, genetic algorithms and reinforcement learning are theoretically discussed. For testing we are using two discrete (multiple knapsack problem and set cover problem) and two continuous tasks (searching for global minimum of Ackley's and Rastrigin's function) which are presented in next chapter. Description of implementation details follows. For example description of solution representation or how current solutions are changed. Finally, results of measurements are presented. They show optimal settings for parameters of given optimization methods considering test tasks. In the end are given test tasks, which will be used for finding optimal settings of given approaches.
|
|
|
Travelling Salesman Problem
Řezníček, Jan ; Zbořil, František (referee) ; Zbořil, František (advisor)
The work focuses on implementing algorithms that solve the Traveling Salesman Problem. It also includes a user interface with a map for importing locations. The main algorithms that are part of the work are ACO and an algorithm that I have devised and implemented. ACO optimization improves results, such as setting initial pheromone levels using the nearest neighbor algorithm. My algorithm works on the principle of gradually improving the path.
|
guest ::
